package com.algorithm.list;

public class SkipListNode<T> {
	int lev;

	public  SkipListNode(T key,int maxLev){
		this.key = key;
		this.lev = maxLev;
		next = new SkipListNode[maxLev];
	}

	public T key;
	public SkipListNode[] next;
}
